Extremal results on stepwise transmission irregular graphs
نویسندگان
چکیده
The transmission TrG(v) of a vertex v connected graph G is the sum distances between and all other vertices in G. stepwise irregular (STI) if |TrG(u) ? TrG(v)| = 1 holds for each edge uv E(G). In this paper, extremal results on STI graphs with respect to size different metric properties are proved. Two families appear cases, balanced complete bipartite odd order so called hatted cycles.
منابع مشابه
Extremal Results in Random Graphs
According to Paul Erdős [Some notes on Turán’s mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Turán who “created the area of extremal problems in graph theory”. However, without a doubt, Paul Erdős popularized extremal combinatorics, by his many contributions to the field, his numerous questions and conjectures, and his influence on discrete mathematicians in Hungary and al...
متن کاملNeighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملExtremal Results in Sparse Pseudorandom Graphs Jacob
3-Connected Minor Minimal Non-Projective Planar Graphs with an Internal 3-Separation Arash Asadi, Georgia Institute of Technology The property that a graph has an embedding in the projective plane is closed under taking minors. So by the well known theorem of Robertson and Seymour, there exists a finite list of minor-minimal graphs, call it L, such that a given graph G is projective planar if a...
متن کاملExtremal results in sparse pseudorandom graphs
Szemerédi’s regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi’s regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi’s regularity lemma us...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2023
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2304271a